An EKF-SLAM algorithm with consistency properties

نویسندگان

  • Axel Barrau
  • Silvere Bonnabel
چکیده

In this paper we address the inconsistency of the EKF-based SLAM algorithm that stems from non-observability of the origin and orientation of the global reference frame. We prove on the non-linear two-dimensional problem with point landmarks observed that this type of inconsistency is remedied using the Invariant EKF, a recently introduced variant of the EKF meant to account for the symmetries of the state space. Extensive Monte-Carlo runs illustrate the theoretical results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EKF SLAM is O(n)

In this paper we show that all processes associated to the move-sense-update cycle of EKF SLAM can be carried out in time linear in the number of map features. We describe Divide and Conquer SLAM, an EKF SLAM algorithm where the computational complexity per step is reduced from O(n) to O(n) (the total cost of SLAM is reduced from O(n) to O(n)). In addition, the resulting vehicle and map estimat...

متن کامل

Robocentric map joining: Improving the consistency of EKF-SLAM

In this paper1 we study the Extended Kalman Filter approach to simultaneous localization and mapping (EKF-SLAM), describing its known properties and limitations, and concentrate on the filter consistency issue. We show that linearization of the inherent nonlinearities of both the vehicle motion and the sensor models frequently drives the solution of the EKF-SLAM out of consistency, specially in...

متن کامل

Limits to the Consistency of Ekf-based Slam

This paper analyzes the consistency of the classical extended Kalman filter (EKF) solution to the simultaneous localization and map building (SLAM) problem. Our results show that in large environments the map quickly becomes inconsistent due to linearization errors. We propose a new EKF-based SLAM algorithm, robocentric mapping, that greatly reduces linearization errors, improving map consisten...

متن کامل

Data Association in O(n) for Divide and Conquer SLAM

In this paper we show that all processes associated to the move-sense-update cycle of EKF SLAM can be carried out in time linear in the number of map features. We describe Divide and Conquer SLAM, an EKF SLAM algorithm where the computational complexity per step is reduced from O(n) to O(n) (the total cost of SLAM is reduced from O(n) to O(n)). In addition, the resulting vehicle and map estimat...

متن کامل

New Adaptive UKF Algorithm to Improve the Accuracy of SLAM

SLAM (Simultaneous Localization and Mapping) is a fundamental problem when an autonomous mobile robot explores an unknown environment by constructing/updating the environment map and localizing itself in this built map. The all-important problem of SLAM is revisited in this paper and a solution based on Adaptive Unscented Kalman Filter (AUKF) is presented. We will explain the detailed algorithm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1510.06263  شماره 

صفحات  -

تاریخ انتشار 2015